On syndrome decoding of Chinese remainder codes
نویسنده
چکیده
A unique decoder for the Chinese remainder codes was stated in [1] in 2000. In this paper, we present a decoder which gives the same error correction radius by introducing syndromes of the Chinese remainder codes. The error positions can be found using a so–called error–locator integer Λ which appears in the proposed key equation. To find Λ, this key equation can be solved by the extended Euclidean algorithm. The sent message can be obtained from the error free positions by the Chinese remainder theorem.
منابع مشابه
On Polynomial Remainder Codes
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding ...
متن کاملChinese Remainder Codes: Using Lattices to Decode Error Correcting Codes Based on Chinese Remaindering Theorem
This report is an incomplete survey of Chinese Remaindering Codes. We study the work of Goldreich, Ron and Sudan [GRS00] and Boneh [B02] which give unique and list-decoding algorithms for an error correcting code based on the Chinese Remaindering Theorem. More specifically, we will look at a decoding algorithm from [GSM00] which uniquely decodes upto (n − k) log p1 log p1+log pn errors. We will...
متن کاملEfficient Decoding Of Reed-Solomon Codes Over Z q Based On Remainder Polynomials
– In 1983, Welch, L.R. and Berlekamp, E.R. introduced a new key equation based on rational interpolation for algebraically decoding Reed-Solomon (RS) codes over finite fields. A key feature of their so-called remainder decoding approach is that the computation of the syndrome vector corresponding to a given received word is not needed. For long codes, this implies significant computational savi...
متن کامل"Soft-decision" Decoding of Chinese Remainder Codes
Given n relatively prime integers p1 < · · · < pn and an integer k < n, the Chinese Remainder Code, CRTp1,...,pn;k, has as its message space M = {0, . . . , ∏k i=1 pi − 1}, and encodes a message m ∈ M as the vector 〈m1, . . . ,mn〉, where mi = m(mod pi). The soft-decision decoding problem for the Chinese remainder code is given as input a vector of residues ~r = 〈r1, . . . , rn〉, a vector of wei...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل